Generalized Bootstrapping Technique Based on Block Equality Test Algorithm
نویسندگان
چکیده
منابع مشابه
Efficient test compression technique based on block merging
Test data compression is an effective methodology for reducing test data volume and testing time. In this paper, we present a new test data compression technique based on block merging. The technique capitalizes on the fact that many consecutive blocks of the test data can be merged together. Compression is achieved by storing the merged block and the number of blocks merged. It also takes adva...
متن کاملOn block bootstrapping areal data
Inference for random processes depends on the estimation of the long-run variance of a statistic. Commonly used approaches in time series analysis for estimating the long-run variance include bootstrap approaches and the class of heteroskedasticity and autocorrelation consistent covariance estimators. These approaches have been generalized to deal with point processes and continuous spatial pro...
متن کاملOn Generalized Intuitionistic Soft Equality
Park et al. (2011) introduced the concept of generalized intuitionistic fuzzy soft sets, which can be seen as an effective mathematical tool to deal with uncertainties. In this paper, the concept of generalized intuitionistic fuzzy soft equality is introduced and some related properties are derived. It is proved that generalized intuitionistic fuzzy soft equality is congruence relation with res...
متن کاملBlock-bootstrapping for noisy data.
BACKGROUND Statistical inference of signals is key to understand fundamental processes in the neurosciences. It is essential to distinguish true from random effects. To this end, statistical concepts of confidence intervals, significance levels and hypothesis tests are employed. Bootstrap-based approaches complement the analytical approaches, replacing the latter whenever these are not possible...
متن کاملBlock - Matching Algorithm Based on Dynamic Search
Dynamic search window adjustment for block-matching algorithm(BMA) based on the block similarity to overcome the computational complexity of full search BMA is presented. The proposed method for adjustment of the size of search window is performed with three steps:(1)Set new search origin based on block similarity and displaced block diierence(DBD), as a displacement of the block which has smal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Security and Communication Networks
سال: 2018
ISSN: 1939-0114,1939-0122
DOI: 10.1155/2018/9325082